Interactive Teaching of Programming Language Theory with a Proof Assistant
نویسندگان
چکیده
منابع مشابه
Teaching Induction with Functional Programming and A Proof Assistant
Mathematical induction is a difficult subject for beginning students of computer science to fully grasp. In this short paper, we propose using functional programming and proof assistants as an aide in teaching mathematical induction in a traditional discrete mathematics course. To demonstrate this approach, we created a proof-ofconcept web-based tutorial on induction. In this tutorial, students...
متن کاملInteractive typed tactic programming in the Coq proof assistant
Interactive Typed Tactic Programming in the Coq Proof Assistant Beta Ziliani 2015 In order to allow for the verification of realistic problems, Coq provides a language for tactic programming, therefore enabling general-purpose scripting of automation routines. However, this language is untyped, and as a result, tactics are known to be difficult to compose, debug, and maintain. In this thesis, I...
متن کاملWinKE: A Proof Assistant for Teaching Logic
WinKE is a new interactive theorem proving assistant based on the KE calculus, a refutation system which combines features from Smullyan's analytic tableaux and Gentzen's natural deduction. It has been developed to support teaching logic and reasoning to undergraduate students. The software is supportive of and complementary to an introductory textbook on classical logic Mondadori and D'Agostin...
متن کاملNumber Theory in a Proof Assistant
This paper discusses the development of elementary number theory in the proof assistant Lean, from the perspective of someone with background in mathematics, but no background in formal verification. I used this project to learn about proof assistants, and this paper shares some of what I learned along the way. A complete listing of the formal results discussed in this paper is available online...
متن کاملTeaching Assistant Work (Ergodic Theory)
1 First Lecture on Entropy Example 1.1 Consider the unilateral shifts f : {1, 2}N → {1, 2}N and g : {1, 2, 3}N → {1, 2, 3}N equipped with the Bernoulli measures μ and ν, respectively. Show that, for any set X ⊂ {1, 2}N satisfying f−1(X) = X and μ(X) = 1, there exists x ∈ X such that #(X ∩ f−1(x)) = 2. Conclude that if k 6= l then (f, μ) and (g, ν) can not be ergodically equivalent. Proof. Denot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Central-European Journal of New Technologies in Research, Education and Practice
سال: 2020
ISSN: 2676-9425
DOI: 10.36427/cejntrep.2.1.470